Optimal transport with convex obstacle
نویسندگان
چکیده
منابع مشابه
Optimal Transport with Branching Distance Costs and the Obstacle Problem
We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dN is a geodesic Borel distance which makes (X, dN ) a possibly branching geodesic space. We show that under some assumptions on the transference plan we can reduce the transport problem to transport problems along family of geodesics. We introduce three assumptions on a given dN -monotone trans...
متن کاملConvex Clustering via Optimal Mass Transport
We consider approximating distributions within the framework of optimal mass transport and specialize to the problem of clustering data sets. Distances between distributions are measured in the Wasserstein metric. The main problem we consider is that of approximating sample distributions by ones with sparse support. This provides a new viewpoint to clustering. We propose different relaxations o...
متن کاملConvex Color Image Segmentation with Optimal Transport Distances
This work is about the use of regularized optimal-transport distances for convex, histogram-based image segmentation. In the considered framework, fixed exemplar histograms define a prior on the statistical features of the two regions in competition. In this paper, we investigate the use of various transport-based cost functions as discrepancy measures and rely on a primaldual algorithm to solv...
متن کاملFree boundaries in optimal transport and Monge-Ampère obstacle problems
Given compactly supported 0 ≤ f, g ∈ L1(R), the problem of transporting a fraction m ≤ min{‖f‖L1 , ‖g‖L1} of the mass of f onto g as cheaply as possible is considered, where cost per unit mass transported is given by a cost function c, typically quadratic c(x,y) = |x − y|/2. This question is shown to be equivalent to a double obstacle problem for the Monge-Ampère equation, for which sufficient ...
متن کاملOptimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance
Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2011
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2011.04.007